Approximating the traffic grooming problem
نویسندگان
چکیده
منابع مشابه
Approximating the Traffic Grooming Problem
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, this can be viewed as assigning colors to the lightpaths so that at most g of them (g being the grooming factor) can share one edge. The cost of a coloring is the number of optical switches (ADMs); each lightpath uses two ADM’s, one at each endpoint, and in case g lightpaths of the same wavelength enter...
متن کاملApproximating the Traffic Grooming Problem in Tree and Star Networks
We consider the problem of grooming paths in all-optical networks with tree topology so as to minimize the switching cost, measured by the total number of used ADMs. We first present efficient approximation algorithms with approximation factor of 2 ln(δ · g) + o(ln(δ · g)) for any fixed node degree bound δ and grooming factor g, and 2 ln g + o(ln g) in unbounded degree directed trees, respectiv...
متن کاملTraffic Grooming in Bidirectional
6 We study the minimization of ADMs (Add-Drop Multiplexers) in optical WDM bidirectional 7 rings considering symmetric shortest path routing and all-to-all unitary requests. We precisely for8 mulate the problem in terms of graph decompositions, and state a general lower bound for all the 9 values of the grooming factor C and N, the size of the ring. We first study exhaustively the cases 10 C = ...
متن کاملThe ring grooming problem
The problem of minimizing the number of bidirectional SONET rings required to support a given traffic demand has been studied by several researchers. Here we study the related problem of minimizing the number of add/drop locations instead of the number of rings; in a number of situations this is a better approximation to the true equipment cost. Our main result is a new lower bound for the case...
متن کاملTraffic Grooming on the Path
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we will say that the grooming factor is C. That means that on a given edge of the network we can groom (group) at most C requests on the same wavelength. With this constraint the objective can be either to minimize th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2008
ISSN: 1570-8667
DOI: 10.1016/j.jda.2007.09.001